turn = int(input())
count = 0
def game(x):
x.sort()
while len(x)>1 and 2048 not in x:
if x.count(min(x)) <2:
del x[0]
else:
for i in range(x.count(min(x))//2):
x.append(2*min(x))
x.sort()
del x[0:x.count(min(x))//2*2]
return x
while count<turn:
count+=1
n = int(input())
test = [int(i) for i in input().split()]
if 2048 in game(test):
print('YES')
else:
print('NO')
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define ios ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
const ll mod = 1e9 + 7;
ll a[200200], b[200200];
void sol() {
ll i, j = 0, k = 0, p = 1e9, q = 0, m = 0, r = 0, w = 0, e = 0, l, n, ans = 0;
string s;
cin >> n;
for (i = 0; i < n; i++) {
cin >> q;
if (q <= 2048)
w += q;
}
if (w >= 2048)
cout << "YES\n";
else
cout << "NO\n";
}
int main() {
ios;
// freopen("input.txt", "rt", stdin);
// freopen("output.txt", "wt", stdout);
ll n, m;
cin >> n;
for (int i = 0; i < n; i++)
sol();
return 0;
}
590. N-ary Tree Postorder Traversal | 589. N-ary Tree Preorder Traversal |
1299. Replace Elements with Greatest Element on Right Side | 1768. Merge Strings Alternately |
561. Array Partition I | 1374. Generate a String With Characters That Have Odd Counts |
1822. Sign of the Product of an Array | 1464. Maximum Product of Two Elements in an Array |
1323. Maximum 69 Number | 832. Flipping an Image |
1295. Find Numbers with Even Number of Digits | 1704. Determine if String Halves Are Alike |
1732. Find the Highest Altitude | 709. To Lower Case |
1688. Count of Matches in Tournament | 1684. Count the Number of Consistent Strings |
1588. Sum of All Odd Length Subarrays | 1662. Check If Two String Arrays are Equivalent |
1832. Check if the Sentence Is Pangram | 1678. Goal Parser Interpretation |
1389. Create Target Array in the Given Order | 1313. Decompress Run-Length Encoded List |
1281. Subtract the Product and Sum of Digits of an Integer | 1342. Number of Steps to Reduce a Number to Zero |
1528. Shuffle String | 1365. How Many Numbers Are Smaller Than the Current Number |
771. Jewels and Stones | 1512. Number of Good Pairs |
672. Richest Customer Wealth | 1470. Shuffle the Array |